Cyclic One-Factorization of the Complete Graph
نویسندگان
چکیده
منابع مشابه
P 9 - Factorization of Complete Bipartite Graph
Pk -factorization of a complete bipartite graph for k, an even integer was studied by H. Wang [1]. Further, Beiling Du [2] extended the work of H.Wang, and studied the P2k-factorization of complete bipartite multigraph. For odd value of k the work on factorization was done by a number of researchers[3,4,5]. P3-factorization of complete bipartite graph was studied by K.Ushio [3]. P5-factorizatio...
متن کاملThe Linear and Cyclic Cutwidth of the Complete Bipartite Graph
We shall consider the problem of embedding the complete bipartite graph, Km,n, onto a linear and cyclic chassis in such a way as to minimize the cutwidth. The linear cutwidth of the complete bipartite graph is established and a partial solution to the cyclic cutwidth is presented. It is known that there is a paper in existance [3] that has established the linear cutwidth of the complete biparti...
متن کاملExistence of cyclic k-cycle systems of the complete graph
Starting from earliest papers by Rosa we solve, directly and explicitly, the existence problem for cyclic k-cycle systems of the complete graph Kv with v ≡ 1 (mod 2k), and the existence problem for cyclic k-cycle systems of the complete m-partite graph Km×k with m and k being odd. As a particular consequence, a cyclic p-cycle system of Kv with p being a prime exists for all admissible values of...
متن کاملCyclic Hamiltonian cycle systems of the complete graph
We prove that there exists a cyclic Hamiltonian k-cycle system of the complete graph if and only if k is odd but k = 15 and p with p prime and ¿ 1. As a consequence we have the existence of a cyclic k-cycle system of the complete graph on km vertices for any pair (k; m) of odd integers with k as above but (k; m) = (3; 3). c © 2003 Elsevier B.V. All rights reserved.
متن کاملArc-transitive regular cyclic covers of the complete bipartite graph
Characterizing regular covers of edge-transitive or arc-transitive graphs is currently a hot topic in algebraic graph theory. In this paper, we will classify arctransitive regular cyclic covers of the complete bipartite graph Kp,p for each odd prime p. The classification consists of four infinite families of graphs. In particular, such covers exist for each odd prime p. The regular elementary a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1985
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(85)80020-2